Reverse convex problems: an approach based on optimality conditions
نویسندگان
چکیده
منابع مشابه
Reverse convex problems: an approach based on optimality conditions
where f ,g :Rn →R are convex continuous functions and S is a nonempty, convex compact in Rn. Such problems have many practical and theoretical applications in telecommunication, mechanics, engineering design, economics, and other fields (see [1, 2, 21], etc.) and have been studied actively over the last four decades (see, e.g., [9, 19] and their references). In addition to these direct applicat...
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملOn Optimality Conditions for Abstract Convex Vector Optimization Problems
A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and 2-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we p...
متن کاملε - optimality conditions for composed convex optimization problems
The aim of the present paper is to provide a formula for the ε subdifferential of f +g ◦h different from the ones which can be found in the existent literature. Further we equivalently characterize this formula by using a so-called closedness type regularity condition expressed by means of the epigraphs of the conjugates of the functions involved. Even more, using the ε subdifferential formula ...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Decision Sciences
سال: 2006
ISSN: 1173-9126,1532-7612
DOI: 10.1155/jamds/2006/29023